Cyclic Codes and Sequences from Kasami-Welch Functions
نویسندگان
چکیده
Let q = 2, 0 ≤ k ≤ n− 1 and k 6= n/2. In this paper we determine the value distribution of following exponential sums
منابع مشابه
A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions
Based on a sufficient condition proposed by Hollmann and Xiang forconstructing triple-error-correcting codes, the minimum distance of a binary cycliccodeC1,3,13 with three zeros α, α3, and α13 of length 2−1 and the weight divisibilityof its dual code are studied, where m ≥ 5 is odd and α is a primitive element of thefinite field F2m . The codeC1,3,13 is proven to hav...
متن کاملOn the Non-linearity of Power Functions
Let L be an extension of degree m of the eld F2. Let be the canonical additive character of L. The Fourier coe cient of the polynomial f(X) 2 L[X ] at the point a 2 L is de ned by b f(a) = P x2L (f(x) + a:x): The spectral magnitude of f , R(f) := supa2F 2 j b f(a)j, is one of the most important cryptographic parameters associated to f [10]. The determination of the spectral magnitude of power f...
متن کاملExponential Sums, Cyclic Codes and Sequences: the Odd Characteristic Kasami Case
Let q = p with n = 2m and p be an odd prime. Let 0 ≤ k ≤ n − 1 and k 6= m. In this paper we determine the value distribution of following exponential(character) sums
متن کاملNew Families of Triple Error Correcting Codes with BCH Parameters
Discovered by Bose, Chaudhuri and Hocquenghem [1], [4], the BCH family of error correcting codes are one of the most studied families in coding theory. They are also among the best performing codes, particularly when the number of errors being corrected is small relative to the code length. In this article we consider binary codes with minimum distance of 7. We construct new families of codes w...
متن کاملA Class of Binary Shortened Cyclic Codes for a Compound Channel
In this paper, a class of shortened cyclic codes for a compound channel will be presented. This class of cyclic codes can be used for combating noises in a practical channel, where both burst errors and random errors occur. As compared with the results of a previous paper by Hsu, Kasami, and Chien (1968) (henceforward will be referred to as HKC codes), the shortened cyclic codes presented will ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0902.4511 شماره
صفحات -
تاریخ انتشار 2009